________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:59:57
Input Data from:  dataset146.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,145
Average f[i]   :4650
Average g[i,j] :2025,49019607843
Total demand   :5400
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 69
> Selected Move:	1960	1	-1	3	6500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1960


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 84
> Selected Move:	2480	1	-1	14	13000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0    >new incumb.: 2480


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 97
> Selected Move:	2960	1	-1	16	18000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0    >new incumb.: 2960


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 108
> Selected Move:	3470	1	-1	5	24500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0    >new incumb.: 3470


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 91
> Selected Move:	3470	3	3	9	22000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 111
> Selected Move:	3470	3	2	10	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  4  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 63
> Selected Move:	3470	4	10	5	23600


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  1  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 76
> Selected Move:	3470	4	5	14	23900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  0  4  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 81
> Selected Move:	3460	3	9	11	23900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  0  4  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 77
> Selected Move:	3460	4	14	5	23600


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  0  1  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 79
> Selected Move:	3460	4	5	10	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  4  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 75
> Selected Move:	3460	3	10	2	22000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 108
> Selected Move:	3450	3	2	17	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  1  0  1  4  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 58
> Selected Move:	3450	4	17	5	22600


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  0  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 76
> Selected Move:	3450	4	5	11	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  4  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 47
> Selected Move:	3450	4	11	14	22900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  4  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 72
> Selected Move:	3450	4	14	16	24900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  1  0  4  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 67
> Selected Move:	3380	3	11	9	24900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 52
> Selected Move:	3380	4	16	5	22600


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 73
> Selected Move:	3380	4	5	14	22900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  0  4  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 71
> Selected Move:	3380	4	14	17	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  0  1  0  1  4  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 68
> Selected Move:	3330	3	16	8	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  4  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 74
> Selected Move:	3330	4	17	5	23100


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  1  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 93
> Selected Move:	3330	4	5	8	24800


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 69
> Selected Move:	3340	3	8	2	22500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 111
> Selected Move:	3430	3	17	7	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 112
> Selected Move:	3440	1	-1	19	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 69
> Selected Move:	3620	3	5	11	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  1  0  0  1  0  0  0  0  1    >new incumb.: 3620


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 114
> Selected Move:	3685	3	9	3	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 69
> Selected Move:	3620	3	3	6	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 85
> Selected Move:	3520	3	6	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 78
> Selected Move:	3550	3	7	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 72
> Selected Move:	3590	3	8	17	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 82
> Selected Move:	3630	3	4	16	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  1  0  1  1  0  1    >new incumb.: 3630


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 72
> Selected Move:	3630	3	17	13	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 94
> Selected Move:	3620	3	13	9	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 113
> Selected Move:	3580	3	11	13	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 95
> Selected Move:	3580	3	13	17	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 77
> Selected Move:	3590	3	16	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 83
> Selected Move:	3560	3	17	8	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 82
> Selected Move:	3540	3	8	11	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 108
> Selected Move:	3475	3	9	3	26000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 68
> Selected Move:	3560	3	4	16	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 67
> Selected Move:	3520	3	3	8	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 78
> Selected Move:	3530	3	11	9	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 81
> Selected Move:	3530	3	16	7	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  1  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 85
> Selected Move:	3560	3	8	3	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 94
> Selected Move:	3523	3	3	18	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 80
> Selected Move:	3490	3	18	16	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 106
> Selected Move:	3515	3	7	3	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 50 #######################


> Neighbours evaluated; 77
> Selected Move:	3490	3	3	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 51 #######################


> Neighbours evaluated; 91
> Selected Move:	3490	3	9	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 52 #######################


> Neighbours evaluated; 99
> Selected Move:	3490	3	12	7	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 53 #######################


> Neighbours evaluated; 104
> Selected Move:	3520	3	16	17	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,28

## ITERATION 54 #######################


> Neighbours evaluated; 108
> Selected Move:	3500	3	17	5	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 55 #######################


> Neighbours evaluated; 98
> Selected Move:	3460	3	5	13	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 56 #######################


> Neighbours evaluated; 101
> Selected Move:	3460	3	7	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 57 #######################


> Neighbours evaluated; 101
> Selected Move:	3460	3	11	9	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 58 #######################


> Neighbours evaluated; 99
> Selected Move:	3460	3	4	7	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 59 #######################


> Neighbours evaluated; 101
> Selected Move:	3470	3	13	17	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 60 #######################


> Neighbours evaluated; 105
> Selected Move:	3400	3	7	11	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 61 #######################


> Neighbours evaluated; 109
> Selected Move:	3400	3	14	15	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 62 #######################


> Neighbours evaluated; 115
> Selected Move:	3550	3	17	16	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 63 #######################


> Neighbours evaluated; 115
> Selected Move:	3575	3	9	3	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 64 #######################


> Neighbours evaluated; 92
> Selected Move:	3565	3	16	7	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 65 #######################


> Neighbours evaluated; 108
> Selected Move:	3440	3	3	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 66 #######################


> Neighbours evaluated; 105
> Selected Move:	3470	3	7	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 67 #######################


> Neighbours evaluated; 102
> Selected Move:	3470	3	11	9	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 68 #######################


> Neighbours evaluated; 105
> Selected Move:	3440	3	4	7	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 69 #######################


> Neighbours evaluated; 107
> Selected Move:	3440	3	7	16	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 70 #######################


> Neighbours evaluated; 90
> Selected Move:	3450	3	8	18	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,195

## ITERATION 71 #######################


> Neighbours evaluated; 93
> Selected Move:	3475	3	15	14	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 72 #######################


> Neighbours evaluated; 86
> Selected Move:	3490	3	18	5	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 73 #######################


> Neighbours evaluated; 104
> Selected Move:	3475	3	9	11	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 74 #######################


> Neighbours evaluated; 101
> Selected Move:	3520	3	5	6	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 75 #######################


> Neighbours evaluated; 100
> Selected Move:	3448	3	14	15	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 76 #######################


> Neighbours evaluated; 105
> Selected Move:	3440	3	6	8	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 77 #######################


> Neighbours evaluated; 86
> Selected Move:	3440	3	8	13	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 78 #######################


> Neighbours evaluated; 107
> Selected Move:	3440	3	11	9	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 79 #######################


> Neighbours evaluated; 103
> Selected Move:	3440	3	13	17	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 80 #######################


> Neighbours evaluated; 90
> Selected Move:	3440	3	9	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 81 #######################


> Neighbours evaluated; 94
> Selected Move:	3430	3	16	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 82 #######################


> Neighbours evaluated; 105
> Selected Move:	3430	3	11	9	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 83 #######################


> Neighbours evaluated; 98
> Selected Move:	3340	3	17	11	23500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 84 #######################


> Neighbours evaluated; 114
> Selected Move:	3420	3	4	7	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 85 #######################


> Neighbours evaluated; 120
> Selected Move:	3433	3	11	18	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 86 #######################


> Neighbours evaluated; 102
> Selected Move:	3405	3	18	3	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 87 #######################


> Neighbours evaluated; 108
> Selected Move:	3435	3	7	16	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 88 #######################


> Neighbours evaluated; 94
> Selected Move:	3330	3	3	7	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 89 #######################


> Neighbours evaluated; 111
> Selected Move:	3373	3	16	5	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 90 #######################


> Neighbours evaluated; 112
> Selected Move:	3385	3	9	11	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 91 #######################


> Neighbours evaluated; 108
> Selected Move:	3420	3	5	6	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 92 #######################


> Neighbours evaluated; 110
> Selected Move:	3350	3	6	10	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 93 #######################


> Neighbours evaluated; 88
> Selected Move:	3418	3	15	14	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 94 #######################


> Neighbours evaluated; 79
> Selected Move:	3465	3	10	18	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 95 #######################


> Neighbours evaluated; 104
> Selected Move:	3355	3	7	16	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 96 #######################


> Neighbours evaluated; 94
> Selected Move:	3380	3	18	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 97 #######################


> Neighbours evaluated; 102
> Selected Move:	3380	3	11	9	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 98 #######################


> Neighbours evaluated; 103
> Selected Move:	3420	3	16	18	26000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 99 #######################


> Neighbours evaluated; 87
> Selected Move:	3395	3	18	3	26000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 100 #######################


> Neighbours evaluated; 92
> Selected Move:	3420	3	4	13	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 101 #######################


> Neighbours evaluated; 99
> Selected Move:	3415	3	9	11	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 102 #######################


> Neighbours evaluated; 88
> Selected Move:	3400	3	3	9	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 103 #######################


> Neighbours evaluated; 106
> Selected Move:	3390	3	11	8	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 104 #######################


> Neighbours evaluated; 83
> Selected Move:	3380	3	9	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 105 #######################


> Neighbours evaluated; 82
> Selected Move:	3370	3	13	9	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 106 #######################


> Neighbours evaluated; 98
> Selected Move:	3370	3	14	15	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 107 #######################


> Neighbours evaluated; 105
> Selected Move:	3390	3	8	13	23500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  1  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 108 #######################


> Neighbours evaluated; 109
> Selected Move:	3400	3	9	3	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 109 #######################


> Neighbours evaluated; 93
> Selected Move:	3355	3	13	4	26000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 110 #######################


> Neighbours evaluated; 91
> Selected Move:	3330	3	15	7	24000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 111 #######################


> Neighbours evaluated; 121
> Selected Move:	3320	3	7	13	24500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 112 #######################


> Neighbours evaluated; 117
> Selected Move:	3320	3	11	9	24500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 113 #######################


> Neighbours evaluated; 119
> Selected Move:	3320	3	13	17	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 114 #######################


> Neighbours evaluated; 118
> Selected Move:	3330	3	4	14	26500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 115 #######################


> Neighbours evaluated; 94
> Selected Move:	3338	3	9	11	26500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 116 #######################


> Neighbours evaluated; 85
> Selected Move:	3345	3	14	15	26500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,215

## ITERATION 117 #######################


> Neighbours evaluated; 86
> Selected Move:	3330	3	3	7	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 118 #######################


> Neighbours evaluated; 104
> Selected Move:	3330	3	11	9	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 119 #######################


> Neighbours evaluated; 106
> Selected Move:	3343	3	17	10	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 120 #######################


> Neighbours evaluated; 89
> Selected Move:	3365	3	15	14	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 121 #######################


> Neighbours evaluated; 83
> Selected Move:	3300	3	10	6	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 122 #######################


> Neighbours evaluated; 104
> Selected Move:	3280	3	7	16	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 123 #######################


> Neighbours evaluated; 105
> Selected Move:	3380	2	6	-1	19500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 124 #######################


> Neighbours evaluated; 106
> Selected Move:	3380	3	2	10	22000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  4  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 125 #######################


> Neighbours evaluated; 92
> Selected Move:	3380	4	10	9	24100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  4  1  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 126 #######################


> Neighbours evaluated; 73
> Selected Move:	3380	4	9	14	21400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  0  4  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 127 #######################


> Neighbours evaluated; 91
> Selected Move:	3510	1	-1	11	25400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  0  0  4  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 128 #######################


> Neighbours evaluated; 66
> Selected Move:	3620	3	10	17	24400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  4  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 129 #######################


> Neighbours evaluated; 74
> Selected Move:	3520	3	14	15	24100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  0  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 130 #######################


> Neighbours evaluated; 74
> Selected Move:	3415	4	15	17	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  0  1  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 131 #######################


> Neighbours evaluated; 56
> Selected Move:	3518	3	15	14	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 132 #######################


> Neighbours evaluated; 70
> Selected Move:	3400	3	17	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  4  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 133 #######################


> Neighbours evaluated; 78
> Selected Move:	3393	3	10	13	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  4  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 134 #######################


> Neighbours evaluated; 63
> Selected Move:	3490	4	13	14	23900


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  1  4  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 135 #######################


> Neighbours evaluated; 91
> Selected Move:	3418	3	11	8	25400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  1  4  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 136 #######################


> Neighbours evaluated; 93
> Selected Move:	3406	3	9	11	25400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  1  4  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 137 #######################


> Neighbours evaluated; 91
> Selected Move:	3389	3	14	15	25100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  1  0  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 138 #######################


> Neighbours evaluated; 95
> Selected Move:	3390	3	8	9	23600


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  1  0  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 139 #######################


> Neighbours evaluated; 89
> Selected Move:	3388	3	11	8	25100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  1  0  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 140 #######################


> Neighbours evaluated; 97
> Selected Move:	3340	3	16	11	24100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  1  0  4  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 141 #######################


> Neighbours evaluated; 96
> Selected Move:	3390	3	13	17	24600


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  0  4  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 142 #######################


> Neighbours evaluated; 87
> Selected Move:	3390	3	15	14	24900


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  4  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 143 #######################


> Neighbours evaluated; 90
> Selected Move:	3420	3	8	4	24400


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  0  0  4  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 144 #######################


> Neighbours evaluated; 72
> Selected Move:	3380	3	17	8	24400


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  0  1  0  0  4  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 145 #######################


> Neighbours evaluated; 92
> Selected Move:	3369	3	11	17	25900


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  0  0  0  0  4  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 146 #######################


> Neighbours evaluated; 73
> Selected Move:	3368	3	17	13	25400


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  0  0  0  1  4  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 147 #######################


> Neighbours evaluated; 83
> Selected Move:	3390	3	4	7	24900


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  0  1  4  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 148 #######################


> Neighbours evaluated; 91
> Selected Move:	3380	3	9	11	24900


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  1  0  1  4  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 149 #######################


> Neighbours evaluated; 90
> Selected Move:	3374	3	7	4	25400


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  0  1  4  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 150 #######################


> Neighbours evaluated; 86
> Selected Move:	3381	3	13	17	25900


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  0  0  4  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 151 #######################


> Neighbours evaluated; 78
> Selected Move:	3356	3	4	16	25900


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  0  4  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 152 #######################


> Neighbours evaluated; 82
> Selected Move:	3411	3	8	3	26900


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  0  4  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 153 #######################


> Neighbours evaluated; 64
> Selected Move:	3380	4	14	3	27000


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  0  1  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 154 #######################


> Neighbours evaluated; 71
> Selected Move:	3360	2	11	-1	23000


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 155 #######################


> Neighbours evaluated; 89
> Selected Move:	3410	3	16	8	23500


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  1  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 156 #######################


> Neighbours evaluated; 100
> Selected Move:	3470	3	17	10	24500


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 157 #######################


> Neighbours evaluated; 91
> Selected Move:	3470	4	3	10	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  4  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 158 #######################


> Neighbours evaluated; 79
> Selected Move:	3470	4	10	14	24400


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  0  4  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 159 #######################


> Neighbours evaluated; 97
> Selected Move:	3410	3	10	17	23400


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  0  4  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 160 #######################


> Neighbours evaluated; 103
> Selected Move:	3410	4	14	8	24800


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  4  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 161 #######################


> Neighbours evaluated; 81
> Selected Move:	3410	4	8	17	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  4  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 162 #######################


> Neighbours evaluated; 100
> Selected Move:	3390	3	17	2	22500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 163 #######################


> Neighbours evaluated; 119
> Selected Move:	3400	3	8	18	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 164 #######################


> Neighbours evaluated; 119
> Selected Move:	3380	3	3	16	22000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 165 #######################


> Neighbours evaluated; 96
> Selected Move:	3390	3	19	5	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 166 #######################


> Neighbours evaluated; 103
> Selected Move:	3390	3	16	7	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 167 #######################


> Neighbours evaluated; 107
> Selected Move:	3430	3	18	3	24000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 168 #######################


> Neighbours evaluated; 117
> Selected Move:	3430	3	3	11	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 169 #######################


> Neighbours evaluated; 116
> Selected Move:	3463	1	-1	9	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  0  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 170 #######################


> Neighbours evaluated; 120
> Selected Move:	3370	3	7	16	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 171 #######################


> Neighbours evaluated; 104
> Selected Move:	3375	3	14	15	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 172 #######################


> Neighbours evaluated; 112
> Selected Move:	3340	3	9	19	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 173 #######################


> Neighbours evaluated; 103
> Selected Move:	3375	3	5	18	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,18

## ITERATION 174 #######################


> Neighbours evaluated; 101
> Selected Move:	3350	3	16	7	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 175 #######################


> Neighbours evaluated; 107
> Selected Move:	3330	3	18	16	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 176 #######################


> Neighbours evaluated; 108
> Selected Move:	3330	3	7	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 177 #######################


> Neighbours evaluated; 103
> Selected Move:	3330	3	11	9	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 178 #######################


> Neighbours evaluated; 104
> Selected Move:	3320	3	12	5	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 179 #######################


> Neighbours evaluated; 93
> Selected Move:	3310	2	19	-1	22000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 180 #######################


> Neighbours evaluated; 118
> Selected Move:	3310	3	2	10	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  4  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 181 #######################


> Neighbours evaluated; 90
> Selected Move:	3310	4	10	5	23600


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  1  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 182 #######################


> Neighbours evaluated; 97
> Selected Move:	3310	4	5	15	23600


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  0  0  4  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 183 #######################


> Neighbours evaluated; 101
> Selected Move:	3310	3	9	11	23600


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  0  0  4  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 184 #######################


> Neighbours evaluated; 96
> Selected Move:	3330	3	5	3	23600


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  1  0  0  0  4  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 185 #######################


> Neighbours evaluated; 92
> Selected Move:	3330	4	15	3	24000


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 186 #######################


> Neighbours evaluated; 91
> Selected Move:	3330	4	3	10	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  4  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 187 #######################


> Neighbours evaluated; 90
> Selected Move:	3330	3	10	2	22000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 188 #######################


> Neighbours evaluated; 119
> Selected Move:	3330	3	2	17	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  0  0  1  1  4  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 189 #######################


> Neighbours evaluated; 71
> Selected Move:	3330	4	17	3	23000


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  0  1  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 190 #######################


> Neighbours evaluated; 82
> Selected Move:	3330	4	3	11	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  4  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 191 #######################


> Neighbours evaluated; 68
> Selected Move:	3330	4	11	15	22600


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  0  0  4  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 192 #######################


> Neighbours evaluated; 84
> Selected Move:	3394	1	-1	19	26600


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  0  0  4  1  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 193 #######################


> Neighbours evaluated; 73
> Selected Move:	3367	3	3	8	25600


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  0  0  0  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 194 #######################


> Neighbours evaluated; 82
> Selected Move:	3370	3	11	9	25600


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  0  0  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 195 #######################


> Neighbours evaluated; 81
> Selected Move:	3420	3	15	14	25900


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  0  4  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,14

## ITERATION 196 #######################


> Neighbours evaluated; 86
> Selected Move:	3444	3	8	3	26900


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  0  0  4  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,145

## ITERATION 197 #######################


> Neighbours evaluated; 69
> Selected Move:	3420	4	14	3	27000


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,15

## ITERATION 198 #######################


> Neighbours evaluated; 73
> Selected Move:	3395	3	3	11	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  4  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,155

## ITERATION 199 #######################


> Neighbours evaluated; 59
> Selected Move:	3403	4	11	16	26400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  1  0  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 200 #######################


> Neighbours evaluated; 71
> Selected Move:	3360	2	9	-1	22400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  0  1  0  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 201 #######################


> Neighbours evaluated; 93
> Selected Move:	3380	3	17	10	23400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  1  0  4  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 202 #######################


> Neighbours evaluated; 94
> Selected Move:	3380	4	16	10	22000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  4  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 203 #######################


> Neighbours evaluated; 97
> Selected Move:	3380	4	10	11	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  4  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 204 #######################


> Neighbours evaluated; 91
> Selected Move:	3380	4	11	14	21400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  4  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 205 #######################


> Neighbours evaluated; 94
> Selected Move:	3380	4	14	19	24100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  1  0  1  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 206 #######################


> Neighbours evaluated; 91
> Selected Move:	3380	3	11	9	24100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 207 #######################


> Neighbours evaluated; 75
> Selected Move:	3380	4	19	16	23400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  0  1  0  4  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 208 #######################


> Neighbours evaluated; 96
> Selected Move:	3317	3	19	5	25900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  0  1  0  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 209 #######################


> Neighbours evaluated; 80
> Selected Move:	3361	3	16	7	25300


> New Y[]: 
	
	 2  3  0  0  0  1  0  4  0  1  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 210 #######################


> Neighbours evaluated; 80
> Selected Move:	3410	4	7	5	23100


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  0  1  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,155

## ITERATION 211 #######################


> Neighbours evaluated; 86
> Selected Move:	3410	4	5	10	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  4  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,15

## ITERATION 212 #######################


> Neighbours evaluated; 82
> Selected Move:	3410	4	10	14	23400


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  1  0  0  0  4  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,145

## ITERATION 213 #######################


> Neighbours evaluated; 99
> Selected Move:	3310	3	7	8	24400


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1  1  0  0  0  4  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,14

## ITERATION 214 #######################


> Neighbours evaluated; 100
> Selected Move:	3330	3	10	17	23400


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1  0  0  0  0  4  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,135

## ITERATION 215 #######################


> Neighbours evaluated; 105
> Selected Move:	3300	3	5	19	20900


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  0  0  4  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,13

## ITERATION 216 #######################


> Neighbours evaluated; 104
> Selected Move:	3388	1	-1	7	25400


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1  0  0  0  0  4  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,125

## ITERATION 217 #######################


> Neighbours evaluated; 103
> Selected Move:	3435	3	17	3	26400


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1  0  0  0  0  4  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,12

## ITERATION 218 #######################


> Neighbours evaluated; 102
> Selected Move:	3442	3	9	11	26400


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  0  0  1  0  0  4  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,115

## ITERATION 219 #######################


> Neighbours evaluated; 102
> Selected Move:	3484	3	14	15	26100


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  0  0  1  0  0  0  4  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,11

## ITERATION 220 #######################


> Neighbours evaluated; 102
> Selected Move:	3445	4	15	3	26500


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  1  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,115

## ITERATION 221 #######################


> Neighbours evaluated; 104
> Selected Move:	3438	3	15	14	26500


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  1  0  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,12

## ITERATION 222 #######################


> Neighbours evaluated; 106
> Selected Move:	3430	3	11	9	26500


> New Y[]: 
	
	 2  3  0  4  0  0  0  1  1  1  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,125

## ITERATION 223 #######################


> Neighbours evaluated; 107
> Selected Move:	3380	3	7	4	27000


> New Y[]: 
	
	 2  3  0  4  1  0  0  0  1  1  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 224 #######################


> Neighbours evaluated; 92
> Selected Move:	3383	4	3	14	26900


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1  0  0  0  0  4  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 225 #######################


> Neighbours evaluated; 91
> Selected Move:	3384	3	9	11	26900


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  0  1  0  0  4  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,14

## ITERATION 226 #######################


> Neighbours evaluated; 90
> Selected Move:	3366	3	14	15	26600


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  0  1  0  0  0  4  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,145

## ITERATION 227 #######################


> Neighbours evaluated; 91
> Selected Move:	3368	3	4	13	26600


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  1  0  4  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,15

## ITERATION 228 #######################


> Neighbours evaluated; 91
> Selected Move:	3355	3	8	16	26100


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  1  0  4  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 229 #######################


> Neighbours evaluated; 82
> Selected Move:	3463	3	15	14	26400


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  1  4  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 230 #######################


> Neighbours evaluated; 83
> Selected Move:	3440	4	14	3	26500


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  0  1  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 231 #######################


> Neighbours evaluated; 90
> Selected Move:	3365	3	13	10	28000


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  1  1  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 232 #######################


> Neighbours evaluated; 74
> Selected Move:	3380	2	11	-1	24000


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 233 #######################


> Neighbours evaluated; 100
> Selected Move:	3380	4	3	10	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  4  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,18
________________________________________________________________

Best solution found: 3630
Run Termination time: 31.01.2010 11:03:12
Run duration: 00:03:14.8281250
________________________________________________________________
